The $K$ -User Vector Gaussian Multiple-Access Channel With General Messages Sets: Capacity, Polymatroidal Structure, and Efficient Computation
نویسندگان
چکیده
منابع مشابه
FDMA Capacity of the Gaussian Multiple Access Channel With ISI
This paper proposes a numerical method for characterizing the achievable rate region for a Gaussian multiple access channel with ISI under the frequency division multiple access restriction. The frequency spectrum is divided into discrete frequency bins and the discrete bin assignment problem is shown to have a convex programming relaxation, making it tractable to numerical algorithms. The run-...
متن کاملA Dual Decomposition Approach to the Sum Power Gaussian Vector Multiple Access Channel Sum Capacity Problem
The Gaussian vector multiple access channel with a sum-power constraint across all users, rather than the usual individual power constraint on each user, has recently been shown to be the dual of a Gaussian vector broadcast channel [1] [2]. Further, a numerical algorithm for the sum capacity under the sum power constraint has been proposed in [3]. This paper proposes a different algorithm for t...
متن کاملOn Capacity Computation for the Two-User Binary Multiple-Access Channel
This paper deals with the problem of computing the boundary of the capacity region for the memoryless two-user binary-input binary-output multiple-access channel ((2, 2; 2)MAC), or equivalently, the computation of input probability distributions maximizing weighted sum-rate. This is equivalent to solving a difficult nonconvex optimization problem. For a restricted class of (2, 2; 2)-MACs and we...
متن کاملOn Capacity and Capacity per Unit Cost of Gaussian Multiple Access Channel with Peak Power Constraints
This paper investigates the capacity and capacity per unit cost of Gaussian multiple-access channel (GMAC) with peak power constraints. We first devise an approach based on Blahut-Arimoto Algorithm to numerically optimize the sum rate and quantify the corresponding input distributions. The results reveal that in the case with identical peak power constraints, the user with higher SNR is to have...
متن کاملSymmetric Two-User Gaussian Interference Channel with Common Messages
We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is to send no common messages and each receiver treats interference as noise. Our result shows that although the availability of common messages provides a coo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2664861